Efficient Evaluation of Well-Formed Attribute Grammars And Beyond
نویسنده
چکیده
This paper is concerned with the evaluation of well-formed attribute grammars as support for semantic analysis. This is the largest class of attribute grammars, which does not impose any restrictions. A data structure and an algorithm are described which are efficient, both in terms of space and time. Attribute grammars are extended from the decoration of trees to the decoration of graphs and to the access of non-local attributes. Experimental results are presented that compare the space and time behaviour of evaluators for well-formed attribute grammars and ordered attribute grammars.
منابع مشابه
Incremental Evaluators for Remote Attribute Grammars
Remote attribute grammars use objects with separately defined fields to induce direct nonlocal dependencies in attribute grammars. Fields of an object may be read remotely from where it is created, and special “collection” fields may be written remotely as well. Building on earlier work which shows that remote attribute grammars can be scheduled statically, this paper shows how they may be impl...
متن کاملUsing logical formulas to improve the expressiveness of Relational Attribute Grammars
Considering the theory of attribute grammars, we use logical formulas instead of traditional functional semantic rules. Following the decoration of a derivation tree, a suitable algorithm should maintain the consistency of the formulas together with the evaluation of the attributes. This may be a Prolog-like resolution, but this paper examines a somewhat different strategy, based on production ...
متن کاملMulti-Plan Attribute Grammars
We identify a new class of non-circular attribute grammars, called the multi-plan attribute grammars, for which static evaluation plans can be computed. The class of multi-plan attribute grammars is larger than all currently known classes of non-circular attribute grammars with static evaluation plans. The decision procedure and the procedure for computing evaluation plans take essentially poly...
متن کاملIncremental Evaluation of Ordered Attribute Grammars for Asynchronous Subtree Replacements
Incremental algorithms for evaluating attribute grammars (AGs) have been extensively studied in recent years, primarily because of their application in language-based environments. Ordered attribute grammars are a subclass of AGs for which efficient evaluators can be constructed. Previous incremental algorithms for ordered attribute grammars only allowed one modification 10 the program at a tim...
متن کاملGenerating Spreadsheet-Like Tools from Strong Attribute Grammars
This paper presents techniques for the formal specification and efficient incremental implementation of spreadsheet-like tools. The spreadsheets are specified by strong attribute grammars. In this style of attribute grammar programming every single inductive computation is expressed within the attribute grammar formalism. Well-known attribute grammar techniques are used to reason about such gra...
متن کامل